https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 Algorithms for the weight constrained shortest path problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12825 Sat 24 Mar 2018 08:17:16 AEDT ]]> LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12793 Sat 24 Mar 2018 08:15:01 AEDT ]]> Accelerated label setting algorithms for the elementary resource constrained shortest path problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12797 Sat 24 Mar 2018 08:15:01 AEDT ]]> Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:24379 conditional non-anticipativity constraints form a very large class, with cardinality in the order of the square of the number of scenarios. However, depending on the properties of the set of scenarios considered, only very few of these constraints may be required for validity of the model. Here we characterize minimal sufficient sets of non-anticipativity constraints, and prove that their matroid structure enables sets of minimum cardinality to be found efficiently, under general conditions on the structure of the scenario set.]]> Sat 24 Mar 2018 07:16:17 AEDT ]]>